Optimal Differential Routing based on Finite State Machine Theory

Finite State Machine Based SDL

Adaptive L-Predictors Based on Finite State Machine Context Selection

In this paper we introduce a new class of adap-tive nonlinear predictors by allowing the parameters of the L-predictor to be selected according to the transitions in a Finite State Machine context modeller. A procedure for the adaptive design of the general un-constrained FSM-context L-predictor is proposed and compared with the classical design techniques for some particular FSM-L predictors. ...

Efficient Sequential ATPG Based on Partitioned Finite-State-Machine Traversal

We present a new automatic test pattern generation algorithm for sequential circuits by traversing the partitioned state spaces. The new features include: (1) nondisjoint state groups are obtained such that two different state groups may have common flip-flops, (2) partial state transition graphs (STGs) are constructed at run time for each state group, (3) spectral information for state variabl...

Tamper-Resistant Software System Based on a Finite State Machine

Many computer systems are designed to make it easy for end-users to install and update software. An undesirable side effect, from the perspective of many software producers, is that hostile end-users may analyze or tamper with the software being installed or updated. This paper proposes a way to avoid the side effect without affecting the ease of installation and updating. We construct a comput...

Probabilistic Analysis for Optimal Speculation of Finite-State Machine Applications

Finite-State Machine (FSM) applications are important for many domains. But FSM computation is inherently sequential, making such applications notoriously difficult to parallelize. Most prior methods address the problem through speculations on simple heuristics, offering limited applicability and inconsistent speedups. This paper provides some principled understanding of FSM parallelization, an...